The QLP Approximation to theSingular
نویسنده
چکیده
In this paper we introduce a new decomposition called the pivoted QLP decomposition. It is computed by applying pivoted orthogonal triangulariza-tion to the columns of the matrix X in question to get an upper triangular factor R and then applying the same procedure to the rows of R to get a lower triangular matrix L. The diagonal elements of R are called the R-values of X; those of L are called the L-values. Numerical examples show that the L-values track the singular values of X with considerable delity | far better than the R-values. At a gap in the L-values the decomposition provides orthonormal bases of analogues of row, column, and null spaces provided of X. The decomposition requires no more than twice the work required for a pivoted QR decomposition. The computation of R and L can be interleaved, so that the computation can be terminated at any suitable point, which makes the decomposition especially suitable for low-rank determination problems. The interleaved algorithm also suggests a new, eecient 2-norm estimator. Abstract In this paper we introduce a new decomposition called the pivoted QLP decomposition. It is computed by applying pivoted orthogonal triangularization to the columns of the matrix X in question to get an upper triangular factor R and then applying the same procedure to the rows of R to get a lower triangular matrix L. The diagonal elements of R are called the R-values of X; those of L are called the L-values. Numerical examples show that the L-values track the singular values of X with considerable delity|far better than the R-values. At a gap in the L-values the decomposition provides orthonormal bases of analogues of row, column, and null spaces provided of X. The decomposition requires no more than twice the work required for a pivoted QR decomposition. The computation of R and L can be interleaved, so that the computation can be terminated at any suitable point, which makes the decomposition especially suitable for low-rank determination problems. The interleaved algorithm also suggests a new, eecient 2-norm estimator.
منابع مشابه
ALGORITHM & DOCUMENTATION: MINRES-QLP for Symmetric and Hermitian Linear Equations and Least-Squares Problems pdfsubject=MINRES-QLP for indefinite or singular symmetric systems
We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-...
متن کاملRegression with Radial Basis Function artificial neural networks using QLP decomposition to prune hidden nodes with different functional form
Radial Basis Function networks with linear output are often used in regression problems because they can be substantially faster to train than Multi-layer Perceptrons. We show how radial base Cauchy, multiquadric and Inverse multiquadric type functions can be used to approximate a rapidly changing continuous test function. In this paper, the performance of the reduced matrix design by QLP decom...
متن کاملALGORITHM xxx: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems
We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the minimum-length solution. In all cases, it circumvents a potential instability in the original MINRES algorithm. A positive-definite preconditioner may be supplied. Our FORTRAN 90 implementation illustra...
متن کاملALGORITHM & DOCUMENTATION: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems pdfsubject=MINRES-QLP for indefinite or singular symmetric systems
We describe algorithm MINRES-QLP and its FORTRAN 90 implementation for solving symmetric or Hermitian linear systems or least-squares problems. If the system is singular, MINRES-QLP computes the unique minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In all cases, it overcomes a potential instability in the original MINRES algorithm. A positive-...
متن کاملA Generic Scheme for Qualified Logic Programming
Uncertainty in Logic Programming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. This report is intended as a first step towards the investigation of qualified computations in Constraint Functional Logic Programming, including uncertain computations as a particular case. We revise an early proposal, namely va...
متن کامل